Applicability of the q-analogue of Zeilberger's algorithm

نویسندگان

  • William Y. C. Chen
  • Qing-Hu Hou
  • Yan-Ping Mu
چکیده

The applicability or terminating condition for the ordinary case of Zeilberger’s algorithm was recently obtained by Abramov. For the qanalogue, the question of whether a bivariate q-hypergeometric term has a qZ-pair remains open. Le has found a solution to this problem when the given bivariate q-hypergeometric term is a rational function in certain powers of q. We solve the problem for the general case by giving a characterization of bivariate q-hypergeometric terms for which the q-analogue of Zeilberger’s algorithm terminates. Moreover, we give an algorithm to determine whether a bivariate q-hypergeometric term has a qZ-pair. AMS Classification: 33F10, 68W30

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Mathematica q - Analogue

Mathematica implementations, available by email request, of q-analogues of Gosper's and Zeilberger's algorithm are described. Nontrivial examples are given in order to illustrate the usage of these packages. The algorithms are based on a new approach to q-hypergeometric telescoping in which a new algebraic concept, q-greatest factorial factorization (qGFF), plays a fundamental role.

متن کامل

A Short Bibliography for Symbolic Summation

A foundation for computer science. [10] Peter Paule and Axel Riese. A Mathematica q-analogue of Zeilberger's algorithm based on an algebraically motivated approach to q-hypergeometric telescoping. [11] Peter Paule and Carsten Schneider. Computer proofs of a new family of harmonic number identities.

متن کامل

A criterion for the applicability of Zeilberger's algorithm to rational functions

We consider the applicability (or terminating condition) of the well-known Zeilberger’s algorithm and give the complete solution to this problem for the case where the original hypergeometric term F(n; k) is a rational function. We specify a class of identities ∑n k=0 F(n; k) = 0; F(n; k)∈C(n; k), that cannot be proven by Zeilberger’s algorithm. Additionally, we give examples showing that the s...

متن کامل

An extension of Zeilberger's fast algorithm to general holonomic functions

We extend Zeilberger's fast algorithm for deenite hypergeometric sum-mation to non-hypergeometric holonomic sequences. The algorithm generalizes to diierential and q-cases as well. Its theoretical justiication is based on a description by linear operators and on the theory of holonomy. R esum e. Nous etendons l'algorithme rapide de Zeilberger pour la sommation hy-perg eom etrique d eenie aux su...

متن کامل

Quantitative Structure Activity Relationship Analysis of Coumarins as Free Radical Scavengers by Genetic Function Algorithm

The antioxidant properties of coumarin derivatives using the 2,2ˈ -diphenyl-1- picrylhydrazyl (DPPH) radical scavenging assay were investigated by the application of Quantitative Structure Activity Relationship (QSAR) studies. The molecular structures were optimized and submitted for the generation of quantum chemical and molecular descriptors. Genetic Function Algorithm (GFA) was employed in m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Symb. Comput.

دوره 39  شماره 

صفحات  -

تاریخ انتشار 2005